Affine designs and linear orthogonal arrays
نویسندگان
چکیده
منابع مشابه
Affine designs and linear orthogonal arrays
It is proved that the collection of blocks of an affine 1-design that yields a linear orthogonal array is a union of parallel classes of hyperplanes in a finite affine space. In particular, for every prime power q and every m ≥ 2 there exists a unique (up to equivalence) complete linear orthogonal array of strength two associated with the classical design of points and hyperplanes in AG(m, q).
متن کاملSliced Latin hypercube designs via orthogonal arrays
Computer experiments are becoming increasingly popular in studying complex real world systems. A special class of sliced Latin hypercube design is proposed in this paper. Such designs are particularly suitable for computer experiments with both qualitative and quantitative factors, multi-fidelity computer experiments, cross-validation and data pooling. The resulting sliced Latin hypercube desig...
متن کاملCluster Orthogonal Arrays and Optimal Fractional Factorial Designs
A generalization of orthogonal arrays, namely cluster orthogonal arrays (CLOA), is introduced and some properties and construction methods are studied. The universal optimality of the fractional factorial designs represented by cluster orthogonal arrays is proved.
متن کاملTaguchi’s Orthogonal Arrays Are Classical Designs of Experiments
Taguchi's catalog of orthogonal arrays is based on the mathematical theory of factorial designs and difference sets developed by R. C. Bose and his associates. These arrays evolved as extensions of factorial designs and latin squares. This paper (1) describes the structure and constructions of Taguchi's orthogonal arrays, (2) illustrates their fractional factorial nature, and (3) points out tha...
متن کاملA linear algebraic approach to orthogonal arrays and Latin squares
To study orthogonal arrays and signed orthogonal arrays, Ray-Chaudhuri and Singhi (1988 and 1994) considered some module spaces. Here, using a linear algebraic approach we define an inclusion matrix and find its rank. In the special case of Latin squares we show that there is a straightforward algorithm for generating a basis for this matrix using the so-called intercalates. We also extend this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2005
ISSN: 0012-365X
DOI: 10.1016/j.disc.2004.04.048